Dominating set - PDFSEARCH.IO - Document Search Engine

Dominating set
Results: 145

#	Item
131	DISS. ETH NO[removed]The Price of Locality: Exploring the Complexity of Distributed Coordination Primitives A dissertation submitted to the Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2006-01-11 11:04:34 NP-complete problems Graph coloring Independent set Dominating set Unit disk graph Connected dominating set Distributed computing Maximal independent set Algorithm Graph theory Theoretical computer science Mathematics
132	Not So Easy Problems For Tree Decomposable Graphs Stefan Szeider∗ Add to Reading List Source URL: www.kr.tuwien.ac.at Language: English - Date: 2009-11-19 11:09:35 NP-complete problems Graph operations Tree decomposition Minor Parameterized complexity Dominating set Chordal graph Equitable coloring Clique Graph theory Theoretical computer science Graph coloring
133	Designs, Codes and Cryptography manuscript No. (will be inserted by the editor) Add to Reading List Source URL: home.coqui.net Language: English - Date: 2014-01-08 04:03:54 Analytic geometry Lattice Dominating set Hypercube graph Neighbourhood Dodecahedron Graph theory Mathematics Theoretical computer science
134	On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-11-12 23:47:30 NP-complete problems Logic in computer science Exponential time hypothesis 2-satisfiability Boolean satisfiability problem Conjunctive normal form Time complexity Parameterized complexity Dominating set Theoretical computer science Computational complexity theory Applied mathematics
135	Choosability of P5-free graphs∗ Petr A. Golovach† Add to Reading List Source URL: www.ii.uib.no Language: English - Date: 2009-05-31 05:49:27 Graph operations List coloring Dominating set Cograph Graph Bipartite graph Degeneracy Graph homomorphism Graph theory Graph coloring NP-complete problems
136	An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem Arash Asadpour∗ Add to Reading List Source URL: www.siam.org Language: English - Date: 2009-12-02 12:21:54 Spanning tree Minimum spanning tree Loop-erased random walk Chernoff bound Eulerian path NP-complete problems Dominating set Holomorphic functional calculus Graph theory Mathematics Theoretical computer science
137	REPORTS IN INFORMATICS Add to Reading List Source URL: www.ii.uib.no Language: English - Date: 2007-08-06 05:58:33 NP-complete problems Dominating set Graph coloring Travelling salesman problem Approximation algorithm Algorithm Feedback vertex set Time complexity Set cover problem Theoretical computer science Computational complexity theory Mathematics
138	A new proof of the graph removal lemma Jacob Fox Add to Reading List Source URL: math.mit.edu Language: English - Date: 2010-12-22 18:03:07 Szemerédi regularity lemma Theoretical computer science Hypergraph Algorithmic version for Szemerédi regularity partition Dominating set Mathematics Graph theory Lemmas
139	PDF Document Add to Reading List Source URL: erikdemaine.org Language: English - Date: 2004-10-18 03:25:13 NP-complete problems Analysis of algorithms Parameterized complexity Planar graphs Graph operations Bidimensionality Apex graph Tree decomposition Dominating set Graph theory Theoretical computer science Mathematics
140	PDF Document Add to Reading List Source URL: www-math.mit.edu Language: English - Date: 2005-12-20 11:13:05 NP-complete problems Combinatorial optimization Operations research Approximation algorithms Linear programming relaxation Generalized assignment problem APX Knapsack problem Dominating set Theoretical computer science Computational complexity theory Applied mathematics

UPDATE